Discretization-based direct random sample generation

نویسندگان

  • Liqun Wang
  • Chel Hee Lee
چکیده

An efficientMonte Carlomethod for random sample generation fromhigh dimensional distributions of complex structures is developed. The method is based on random discretization of the sample space and direct inversion of the discretized cumulative distribution function. It requires only the knowledge of the target density function up to a multiplicative constant and applies to standard distributions as well as high-dimensional distributions arising from real data applications. Numerical examples and real data applications are used for illustration. The algorithms are implemented in statistical software R and a package dsample has been developed and is available online. © 2013 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct Numerical Simulation of the Wake Flow Behind a Cylinder Using Random Vortex Method in Medium to High Reynolds Numbers

Direct numerical simulation of turbulent flow behind a cylinder, wake flow, using the random vortex method for an incompressible fluid in two dimensions is presented. In the random vortex method, the primary variable is vorticity of the flow field. After generation on the cylinder wall, it is followed in two fractional time step in a Lagrangian system of coordinates, namely convection and diffu...

متن کامل

Accuracy in Random Number Generation

The generation of continuous random variables on a digital computer encounters a problem of accuracy caused by approximations and discretization error. These in turn impose a bias on the simulation results. An ideal discrete approximation of a continuous distribution and a measure of error are proposed. Heuristic analysis of common methods for transforming uniform deviates to other continuous r...

متن کامل

On the number of iterations required by Von Neumann addition

We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm a...

متن کامل

Topology-Guided Sampling of Nonhomogeneous Random Fields

Topological measurements are increasingly being accepted as an important tool for quantifying complex structures. In many applications these structures can be expressed as nodal domains of real-valued functions and are obtained only through experimental observation or numerical simulations. In both cases, the data on which the topological measurements are based are derived via some form of fini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2014